Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs
نویسندگان
چکیده
منابع مشابه
Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs
A digraph is 3-quasi-transitive (resp. 3-transitive), if for any path x0x1 x2x3 of length 3, x0 and x3 are adjacent (resp. x0 dominates x3). César Hernández-Cruz conjectured that if D is a 3-quasi-transitive digraph, then the underlying graph of D, UG(D), admits a 3-transitive orientation. In this paper, we shall prove that the conjecture is true.
متن کامل3-transitive Digraphs
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is 3-transitive if the existence of the directed path (u, v, w, x) of length 3 in D implies the existence of the arc (u, x) ∈ A(D). In this article strong 3-transitive digraphs are characterized and the structure of non-strong 3-transitive digraphs is described. The results are used, e.g...
متن کاملquasi - transitive digraphs ∗
Let D = (V , A) be a directed graph (digraph) without loops nor multiple arcs. A set of vertices S of a digraph D is a (k, l)-kernel of D if and only if for any two vertices u, v in S, d(u, v) ≥ k and for any vertex u in V \ S there exists v in S such that d(u, v) ≤ l. A digraph D is called quasi-transitive if and only if for any distinct vertices u, v, w of D such that u→ v → w, then u and w a...
متن کاملOn the structure of strong 3-quasi-transitive digraphs
In this paper, D = (V (D), A(D)) denotes a loopless directed graph (digraph) with at most one arc from u to v for every pair of vertices u and v of V (D). Given a digraph D, we say that D is 3-quasi-transitive if, whenever u → v → w → z in D, then u and z are adjacent. In [3], Bang-Jensen introduced 3-quasi-transitive digraphs and claimed that the only strong 3quasi-transitive digraphs are the ...
متن کاملKernels in quasi-transitive digraphs
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2013
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1680